HEMI: Hyperedge Majority Influence Maximization
نویسندگان
چکیده
In this work, we consider the problem of influence maximization on a hypergraph. We first extend the Independent Cascade (IC) model to hypergraphs, and prove that the traditional influence maximization problem remains submodular. We then present a variant of the influence maximization problem (HEMI) where one seeks to maximize the number of hyperedges, a majority of whose nodes are influenced. We prove that HEMI is non-submodular under the diffusion model proposed.
منابع مشابه
Recent Advances in Information Diffusion and Influence Maximization of Complex Social Networks
1.1 Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 Social Influence And Influence Maximization . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملOn the effect of hyperedge weights on hypergraph learning
Hypergraph is a powerful representation in several computer vision, machine learning and pattern recognition problems. In the last decade, many researchers have been keen to develop different hypergraph models. In contrast, no much attention has been paid to the design of hyperedge weights. However, many studies on pairwise graphs show that the choice of edge weight can significantly influence ...
متن کاملReestimation of Reified Rules in Semiring Parsing and Biparsing
We show that reifying the rules from hyperedge weights to first-class graph nodes automatically gives us rule expectations in any kind of grammar expressible as a deductive system, without any explicit algorithm for calculating rule expectations (such as the insideoutside algorithm). This gives us expectation maximization training for any grammar class with a parsing algorithm that can be state...
متن کاملHypergraph Grammars for Knowledge Based Model Construction
Graphical belief networks, including Bayes nets and influence diagrams, can be represented with directed hypergraphs. Each directed hyperedge corresponds to a factor of the joint distribution of all variables in the model. A hyperedge replacement grammar is a collection of rules for replacing hyperedges with hypergraphs. A hyperedge replacement grammar for graphical belief networks defines a co...
متن کاملDon't Be Greedy: Leveraging Community Structure to Find High Quality Seed Sets for Influence Maximization
We consider the problem of maximizing the spread of influence in a social network by choosing a fixed number of initial seeds — a central problem in the study of network cascades. The majority of existing work on this problem, formally referred to as the influence maximization problem, is designed for submodular cascades. Despite the empirical evidence that many cascades are non-submodular, lit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016